|
|
Design of the slab bridge
Strouhalová, Petra ; Krejčík, Vladimír (referee) ; Klusáček, Ladislav (advisor)
This thesis deals with design and solution of road slab bridge structure. Draft prestressing force is processed using the load balancing, the thickness of the slab is consedered in five variants. The aim of this thesis is to determine which option is appropriate for prestressing and which not and subsequently one selected variant design.
|
|
|
Load Balancing in OpenFlow Networks
Marciniak, Petr ; Ryšavý, Ondřej (referee) ; Grégr, Matěj (advisor)
The aim of this thesis is to develop a load balancing tool for OpenFlow networks. Software-defined networking (SDN) principles are introduced (OpenFlow protocol used as an example) and compared to the legacy routing and switching technology. Openflow is the first protocol/API enabling communication between the control and infrastructure planes of the software-defined networking model. Key features of the protocol are described and several OpenFlow controllers are introduced. Current best practices in computer networks load balancing are discussed as well. The load balancing application development process is described including the test laboratory setups - Mininet (SW) and OFELIA (HW). The application test results are evaluated and possible further enhancements to the program are discussed.
|
|
|
Dynamic Metric in OSPF Networks
Mácha, Tomáš ; Orgoň, Miloš (referee) ; Bešťák, Robert (referee) ; Novotný, Vít (advisor)
Masivní vývoj Internetu vedl ke zvýšeným požadavkům na spolehlivou síťovou infrastrukturu. Efektivita komunikace v síti závisí na schopnosti směrovačů určit nejlepší cestu pro odesílání a přeposílání paketů ke koncovému zařízení. Jelikož OSPF v současné době představuje jeden z nejpoužívanějších směrovacích protokolů, jakýkoli přínos, který by pomohl udržet krok s rychle se měnícím prostředí Internetu, je velmi vítán. Významným omezením OSPF protokolu je, mimo jiné, absence informovanosti algoritmu pro výpočet metriky o aktuálním vytížení linky. Tato vlastnost představuje tzv. slabé místo, což má negativní vliv na výkonnost sítě. Z tohoto důvodu byla navržena nová metoda založená na dynamické adaptaci měnících se síťových podmínek a alternativní strategii OSPF metrik. Navržená metoda řeší problém neinformovanosti OSPF metriky o síťovém provozu a nevhodně vytížených linek, které snižují výkonnost sítě. Práce rovněž přináší praktickou realizaci, kdy vlastnosti nové metody jsou testovány a ověřeny spuštěním testů algoritmu v reálných zařízeních.
|
|
|
Highly Available Scalable CMS in the Java EE Environment
Šramko, Samuel ; Kolář, Dušan (referee) ; Burget, Radek (advisor)
This thesis deals with the background of the design of a highly available, scalable and modular content management system based on the Java EE platform and the OSGi framework and with the implementation of the designed system. It describes the design and implementation of the application decomposition to modules, their communication and bindings. Finally, it presents the results of the application testing and proposes available extensions of the application.
|
|
|
Dynamic resource balancing in virtualization clusters
Grafnetter, Michael ; Yaghob, Jakub (advisor) ; Děcký, Martin (referee)
The purpose of this thesis was to analyze the problem of resource load balancing in virtualization clusters. Another aim was to implement a pilot version of resource load balancer for the VMware vSphere Standard-based virtualization cluster. The thesis also inspected available commercial and open source resource load balancers and examined their usability and effectiveness. While designing the custom solution, a modification of the greedy algorithm has been chosen to be used to determine which virtual machines should be migrated and to select their target hosts. Furthermore, experiments have been conducted to determine some parameters for the algorithm. Finally, it was experimentally verified that the implemented solution can be applied to effectively balance virtualization server workloads by live migrating virtual machines running on these hosts.
|
|
|
Balancing Keyword-Based Data and Queries in Distributed Storage Systems
Wirth, Martin ; Parízek, Pavel (advisor) ; Zavoral, Filip (referee)
Research in the area of load balancing in distributed systems has not yet come with an optimal load balancing technique. Existing approaches work primarily with replication and sharding. This thesis overviews existing knowledge in this area with focus on shard- ing, and provides an experiment comparing a state-of-the-art load balancing technique called Weighed-Move with a random baseline and an existing domain-specific balancing implementation. As a significant part of the project, we engineered a generic and scal- able load balancer that may be used in any distributed system and deployed it into an existing ad system called Sklik. The major challenges appeared to be tackling various problems related to data consistency, performance and synchronization, together with solving compatibility issues with the rest of the still-evolving ad system. Our experiment shows that the domain-specific load balancing implementation produces data distribution that enables better performance, but Weighed-Move proved to have a great potential and its results are expected to be enhanced by further work on our implementation. 1
|
|
|
Clustering a load balancing serveru pro zpracování řeči
Trnka, Miroslav
This paper deals with the possibilities for load balancing and clustering of an existing server for speech processing. The paper analyzes problems of load balancing and clustering. There are also described the concepts of network programming and options for I/O processing. A new design of a load balancer is created, fully customized for the needs of speech processing server. This newly designed load balancer is implemented and thoroughly tested.
|
|
|
Load Balancing in Evaluation Systems for Programming Assignments
Buchar, Jan ; Kruliš, Martin (advisor) ; Tůma, Petr (referee)
Systems for automated evaluation of assignments are a valuable aid for both teachers of programming courses and their students. The objective of this thesis is to examine the possibilities of deploying such systems in a large-scale distributed environment and the challenges of such endeavors. A sizable part of the requirements comes from experience with ReCodEx - an assignment evaluation system developed at the department of the supervisor. Modern server multi-core processors provide considerable computing power that can be used for assignment evaluation. However, parallel measurements can interfere with each other. This causes unstable results, which detriments the fairness of grading. Isolation (sandboxing) technologies can cause similar effects. We measure both of these influences and use the results to determine to what degree can multi-core processors be exploited. The problem of efficient distribution of work between multiple evaluation workers is complementary to that of utilizing multi-core machines. We survey scheduling algorithms and design an experiment to compare their performance. Additionally, we examine the possibility of leveraging container technologies to simplify the deployment of software required for evaluation. This leads to both a smaller administration overhead and a less complex...
|
|
|
Analyzujte možnosti aplikace strojového učení na load-balancing
Sýkora, Jan ; Pecinovský, Rudolf (advisor) ; Šlajchrt, Zbyněk (referee)
Both machine learning and HTTP load balancing are well known and widely researched concepts and methods. My diploma thesis addresses possible applications of machine learning to HTTP load balancing. The main objective is to find a method to achieve better utilization of load balancing. This objective can reduce monetary costs and provide better stability of a load balanced system. In the first part, machine learning workflow and methods are described in order to analyze whether such methods could be applied to load balancing systems. After that, the current state of HTTP load balancing methods and strategies is outlined. Finally, a load balancing method using machine learning is designed and tested. The method is based on the least loaded approach using predicted values to balance HTTP traffic, the machine learning models were selected by using a grid search to find the most accurate models. These meth-ods were tested and performed well in comparison to other methods. The tests were conducted with over a hundred machine learning models, not all models were accurate or had short enough learning times. Lacking those factors deemed them unsuitable for later tests. The models were compared based on measured utilization and performance metrics for regression based machine learning models. The designed method could be applied to real world systems, however, it would require defining a domain specific metric. The applications should also employ a grid search in order to find the most accurate machine learning model.
|
|
|
Dynamic resource balancing in virtualization clusters
Grafnetter, Michael ; Yaghob, Jakub (advisor) ; Děcký, Martin (referee)
The purpose of this thesis was to analyze the problem of resource load balancing in virtualization clusters. Another aim was to implement a pilot version of resource load balancer for the VMware vSphere Standard-based virtualization cluster. The thesis also inspected available commercial and open source resource load balancers and examined their usability and effectiveness. While designing the custom solution, a modification of the greedy algorithm has been chosen to be used to determine which virtual machines should be migrated and to select their target hosts. Furthermore, experiments have been conducted to determine some parameters for the algorithm. Finally, it was experimentally verified that the implemented solution can be applied to effectively balance virtualization server workloads by live migrating virtual machines running on these hosts.
|
guest ::
